Tootfinder

This https://arxiv.org/abs/2402.05910 has been replaced.
link: https://scholar.google.com/scholar?q=a

Background independent tensor networks
Conventional holographic tensor networks can be described as toy holographic maps constructed from many small linear maps acting in a spatially local way, all connected together with ``background entanglement'', i.e. links of a fixed state, often the maximally entangled state. However, these constructions fall short of modeling real holographic maps. One reason is that their ``areas'' are trivial, taking the same value for all states, unlike in gravity where the geometry is dynamical. Recently,…

"We call for an urgent, robust, and independent review of the links between the pharmaceutical industry and the NHS. We call for a system that does what was demanded by the health committee two decades ago , , ,"
Terrific piece by #MargeretMcCartney et al

This https://arxiv.org/abs/2402.05910 has been replaced.
link: https://scholar.google.com/scholar?q=a

Background independent tensor networks
Conventional holographic tensor networks can be described as toy holographic maps constructed from many small linear maps acting in a spatially local way, all connected together with ``background entanglement'', i.e. links of a fixed state, often the maximally entangled state. However, these constructions fall short of modeling real holographic maps. One reason is that their ``areas'' are trivial, taking the same value for all states, unlike in gravity where the geometry is dynamical. Recently,…

This https://arxiv.org/abs/1905.07342 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pair-Matching: Links Prediction with Adaptive Queries
The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, represent the good matches. The algorithm queries pairs of nodes and observes the presence/absence of edges. Its goal is to discover as many edges as possible with a fixed budget of queries. Pair-matching is a particular instance of multi-armed bandit…

This https://arxiv.org/abs/1905.07342 has been replaced.
link: https://scholar.google.com/scholar?q=a

Pair-Matching: Links Prediction with Adaptive Queries
The pair-matching problem appears in many applications where one wants to discover good matches between pairs of entities or individuals. Formally, the set of individuals is represented by the nodes of a graph where the edges, unobserved at first, represent the good matches. The algorithm queries pairs of nodes and observes the presence/absence of edges. Its goal is to discover as many edges as possible with a fixed budget of queries. Pair-matching is a particular instance of multi-armed bandit…